Graph matching and clustering using spectral partitions
نویسندگان
چکیده
منابع مشابه
Graph matching and clustering using spectral partitions
Although inexact graph-matching is a problem of potentially exponential complexity, the problem may be simplified by decomposing the graphs to be matched into smaller subgraphs. If this is done, then the process may cast into a hierarchical framework and hence rendered suitable for parallel computation. In this paper we describe a spectral method which can be used to partition graphs into nonov...
متن کاملSpectral clustering for divide-and-conquer graph matching
We present a parallelized bijective graph matching algorithm that leverages seeds and is designed to match very large graphs. Our algorithm combines spectral graph embedding with existing state-of-the-art seeded graph matching procedures. We justify our approach by proving that modestly correlated, large stochastic block model random graphs are correctly matched utilizing very few seeds through...
متن کاملMulti-Attributed Graph Matching: a Spectral Clustering Approach
We present a Multiple Attribute Graph (MARG) Matching algorithm. The algorithm operates on a strong product graph, where vertices correspond to hypothesized matchings between two nodes and edges specify compatibilities between two matches. We show how the matching problem reduces to partitioning the strong product graph, which we solve with spectral clustering. We test our algorithm on a few im...
متن کاملSpectral Graph Clustering
Spectral clustering is a powerful technique in data analysis that has found increasing support and application in many areas. This report is geared to give an introduction to its methods, presenting the most common algorithms, discussing advantages and disadvantages of each, rather than endorsing one of them as the best, because, arguably, there is no black-box algorithm, which performs equally...
متن کاملA Spectral Algorithm for Improving Graph Partitions
In the cut-improvement problem, we are asked, given a starting cut (T, T̄ ) in a graphG, to find a cut with low conductance around (T, T̄ ) or produce a certificate that there is none. More precisely, for a notion of correlation between cuts, cut-improvement algorithms seek to produce approximation guarantees of the following form: for any cut (C, C̄) that is ε-correlated with the input cut, the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2006
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2005.06.014